System and method for controlling time dilation in time-sensitive networks

ABSTRACT

A system and method determine a clock drift and a clock variance of each node in plural nodes of a time-sensitive Ethernet network. An accumulated clock offset along a time-sensitive network path in the time-sensitive network is determined based on the clock drifts and the clock variances. A guard band having a dynamic size is determined based on the accumulated clock offset. The times at which Ethernet frames are communicated through the nodes are restricted by communicating the guard band with the dynamic size to one or more of the nodes.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to U.S. Provisional Patent ApplicationNo. 62/575,719, which was filed on 23 Oct. 2017, and the entiredisclosure of which is incorporated herein by reference.

FIELD

The subject matter described herein relates to computerizedcommunication networks, such as time-sensitive networks.

BACKGROUND

The IEEE 802.1 Time-Sensitive Networking Task Group has created a seriesof standards that describe how to implement deterministic, scheduledEthernet frame delivery within an Ethernet network. Time-sensitivenetworking benefits from advances in time precision and stability tocreate efficient, deterministic traffic flows in an Ethernet network.

But, clocks in the networks have not achieved the level of accuracy andstability to perfectly schedule time-sensitive network flows. Clocksynchronization errors may lead the frames to arrive ahead or behindtheir schedule. In this case, time-sensitive network frames can bedelayed in an unpredictable manner, thus defeating the purpose of adeterministic Ethernet.

BRIEF DESCRIPTION

In one embodiment, a method includes determining a clock drift and aclock variance of each node in plural nodes of a time-sensitive Ethernetnetwork, determining an accumulated clock offset along a time-sensitivenetwork path in the time-sensitive network based on the clock drifts andthe clock variances that are determined, determining a guard band havinga dynamic size based on the accumulated clock offset, and restrictingwhen Ethernet frames are communicated through the nodes by communicatingthe guard band with the dynamic size to one or more of the nodes.

In one embodiment, a system includes one or more processors configuredto determine a clock drift and a clock variance of each node in pluralnodes of a time-sensitive network. The one or more processors also areconfigured to determine an accumulated clock offset along atime-sensitive network path in the time-sensitive network based on theclock drifts and the clock variances that are determined. The one ormore processors also are configured to determine a guard band having adynamic size based on the accumulated clock offset and to communicatethe guard band with the dynamic size to the nodes. The one or moreprocessors are configured to allocate the guard band to at least one ofthe nodes. The guard band restricts when Ethernet frames arecommunicated through the at least one of the nodes.

In one embodiment, a system includes one or more processors configuredto determine clock drifts and clock variances of plural nodes in atime-sensitive Ethernet network. The one or more processors also areconfigured to determine an eigenvalue centrality metric based on alocation of one or more of the nodes in the time-sensitive network. Theone or more processors are configured to dynamically allocate a guardband to one or more of the nodes to prevent communication of one or moreEthernet frames through the one or more nodes during the guard band in atime sensitive network schedule of the Ethernet network. The one or moreprocessors are configured to dynamically allocate the guard band basedon the clock drifts, the clock variances, and the eigenvalue centralitymetric.

BRIEF DESCRIPTION OF THE DRAWINGS

The present inventive subject matter will be better understood fromreading the following description of non-limiting embodiments, withreference to the attached drawings, wherein below:

FIG. 1 schematically illustrates one embodiment of a time-sensitivenetwork system;

FIG. 2 illustrates a high-level concept behind the analysis describedherein;

FIG. 3 illustrates a fundamental model showing a master clock and aslave clock separated by an Ethernet link;

FIG. 4 illustrates one example of synchronization error analysis usingmulticast;

FIG. 5 illustrates probabilities of frame collision along several paths;and

FIG. 6 illustrates a flowchart of one embodiment of a method fordynamically determining guard bands for a time-sensitive network.

DETAILED DESCRIPTION

One or more embodiments of the inventive subject matter described hereinprovide systems and methods that use efficient determinism oftime-sensitive networking to increase cybersecurity by examiningpositive feedback between non-classical physics and time-sensitivenetworking. The difference of elapsed time that occurs due to relativityis treated by the timing and synchronization standard as a contributionto clock drift of network nodes (e.g., switches) and a time-awarescheduler device of a time-sensitive network is configured relative to atime reference of a grandmaster clock device of the network, but thenloses simultaneity with a local relative time reference of the schedulerdevice.

FIG. 1 schematically illustrates one embodiment of a network controlsystem 107 of a time-sensitive network system 100. The components shownin FIG. 1 represent hardware circuitry that includes and/or is connectedwith one or more processors (e.g., one or more microprocessors, fieldprogrammable gate arrays, and/or integrated circuits) that operate toperform the functions described herein. The components of the networksystem 100 can be communicatively coupled with each other by one or morewired and/or wireless connections. Not all connections between thecomponents of the network system 100 are shown herein.

The network system 100 includes several nodes 105 formed of networkswitches 104 and associated clocks 112 (“clock devices” in FIG. 1).While only a few nodes 105 are shown in FIG. 1, the network system 100can be formed of many more nodes 105 distributed over a large geographicarea. The network system 100 can be an Ethernet network thatcommunicates data signals along, through, or via Ethernet links 103between devices 106 (e.g., computers, control systems, etc.) through orvia the nodes 105. The data signals are communicated as data packetssent between the nodes 105 on a schedule of the network system 100, withthe schedule restricted what data signals can be communicated by each ofthe nodes 105 at different times. For example, different data signalscan be communicated at different repeating scheduled time periods basedon traffic classifications of the signals. Some signals are classifiedas time-critical traffic while other signals are classified as besteffort traffic. The time-critical traffic can be data signals that needor are required to be communicated at or within designated periods oftime to ensure the safe operation of a powered system. The best efforttraffic includes data signals that are not required to ensure the safeoperation of the powered system, but that are communicated for otherpurposes (e.g., monitoring operation of components of the poweredsystem).

The control system 107 includes a time-aware scheduler device 102 thatenables each interface of a node 105 to transmit an Ethernet frame(e.g., between nodes 105 from one computer device 106 to another device106) at a prescheduled time, creating deterministic traffic flows whilesharing the same media with legacy, best-effort Ethernet traffic. Thetime-sensitive network 100 has been developed to support hard, real-timeapplications where delivery of frames of time-critical traffic must meettight schedules without causing failure, particularly in life-criticalindustrial control systems. The scheduler device 102 computes a schedulethat is installed at each node 105 in the network system 100. Thisschedule dictates when different types or classification of signals arecommunicated by the switches 104.

The scheduler device 102 remains synchronized with a grandmaster clockdevice 110 as clock instability results in unpredictable latency whenframes are transmitted. The grandmaster clock device 110 is a clock towhich clock devices 112 of the nodes 105 are synchronized. A consequenceof accumulated clock drift is that a frame misses a time window for theframe, and must wait for the next window. This can conflict with thenext frame requiring the same window.

A centralized network configurator device 108 of the control system 107is comprised of software and/or hardware that has knowledge of thephysical topology of the network 100 as well as desired time-sensitivenetwork traffic flows. The configurator device 108 can be formed fromhardware circuitry that is connected with and/or includes one or moreprocessors that determine or otherwise obtain the topology informationfrom the nodes 105 and/or user input. The hardware circuitry and/orprocessors of the configurator device 108 can be at least partiallyshared with the hardware circuitry and/or processors of the schedulerdevice 102.

The topology knowledge of the network system 100 can include locationsof nodes 105 (e.g., absolute and/or relative locations), which nodes 105are directly coupled with other nodes 105, etc. The configurator device108 can provide this information to the scheduler device 102, which usesthe topology information to determine the schedules. The configuratordevice 108 and/or scheduler device 102 can communicate the schedule tothe different nodes 105.

A link layer discovery protocol can be used to exchange the data betweenthe configurator device 108 and the scheduler device 102. The schedulerdevice 102 communicates with the time-aware systems (e.g., the switches104 with respective clocks 112) through a network management protocol.The time-aware systems implement a control plane element that forwardsthe commands from the centralized scheduler device 102 to theirrespective hardware.

The Timing and Synchronization standard is an enabler for the schedulerdevice 102. The IEEE 802.1AS (gPTP) standard can be used by thescheduler device 102 to achieve clock synchronization by choosing thegrandmaster clock device 110 (e.g., which may be a clock device 112 ofone of the switch devices 104), estimating path delays, and compensatingfor differences in clock rates, thereby periodically pulling clockdevices 112 back into alignment with the time that is kept by thegrandmaster clock device 110. By pulling the clock devices 112 back intoalignment with the grandmaster clock device 112, the use of phase lockedloops (PLL) are not used in one embodiment of the network system 100 dueto the slow convergence of the loops and because the loops are prone togain peaking effect.

The clock devices 112 can be measured by the configurator device 108 orthe grandmaster clock device 110 periodically or otherwise repeatedlysending generalized time-precision protocol messages (gPTP). Theoperation consists mainly of comparing the timestamps of thetime-precision protocol messages the transmits or receives of localswitch device 104 with the timestamps advertised by neighbor switchdevices 104. This way, any factors affecting clock drift are correctlydetected by the protocol.

A clock device 112 that is suddenly pulled into the past or moved to thefuture relative to the time kept by the grandmaster clock device 110 canimpact the local execution of a time-aware schedule. For example,time-critical traffic may not be communicated by the node 105 thatincludes the non-synchronized clock device 112 within the scheduled timeperiod for time-critical traffic. The gPTP standard provides acontinuous and monotonically increasing clock device 112. Consequently,the scheduler device 102 relies on a clock device 112 that cannot beadjusted and alignment of the clock device 112 is based on logicalsyntonization, offset from the grand master clock device 110, the linkpropagation delays with the neighbors, and the clock drifts between thelocal clock devices 112.

The IEEE 802.1AS standard can be used to detect intrinsic instabilityand drift of a clock device 112. This drift can occur for a variety ofreasons, such as aging of the clock device 112, changes in temperatureor extreme temperatures, etc. Relativistic effects from the theory ofspecial and general relativity can be viewed as an extrinsic clock driftand can encompass gravitational and motion time dilation. For example,two clock devices 112 with the same intrinsic parameters would detect nodrift, but relativity would cause drift of the time kept by these clockdevices 112 from the grandmaster clock device 110.

While general relativity can be rather complicated, gravitational timedilation is straight-forward to apply. In the equation that follows, Gis the gravitational constant, M is the mass of the gravitational bodyin kilograms, R is the radius, or the distance from the center of themass, in meters, and c is the speed of light in meters per second. Twoclock devices 112, one located at a height of 100 m within the Earth'sgravitational field and another at an infinite distance from agravitational field, that is, experiencing no gravitation. Time passesslower within a gravitational field, so the hypothetical clock device112 located at infinity would be the fastest known clock device 112.When one second has passed for the clock device 112 located at infinity,consider how much time has passed as measured by the clock near Earth.The time at infinity is denoted as T and the time on Earth as T₀. Todetermine how much time has passed on a clock device 112 at altitude has compared to the passage of time measured on a clock at the surface ofthe earth, calculate the time dilation ratio at altitude h and dividethis by the time dilation calculated at the surface of the earth, takethe square root of the result and then multiply this calculated ratio bythe time interval at the surface of the earth and the result of thecalculation is the amount of time that has passed on the faster clock by11 femtoseconds compared to the clock device 112 located higher in thefield at altitude h.

$\begin{matrix}{T = {\sqrt{\frac{1 - \frac{2\;{GM}}{\left( {R + h} \right)c^{2}}}{1 - \frac{2\;{GM}}{{Rc}^{2}}}}T_{0}}} & (1)\end{matrix}$

Clock drift induced by gravitational time dilation seems negligible atfirst glance. Particularly when the speed of transmission is of 1 Gbps.It means that, to make an Ethernet frame of 64 bytes miss its Time-Awareschedule, 672 ns of drift must have elapsed if it is considered that forthe 20 bytes of preamble, start frame delimiter, frame check sequenceand interframe gap, for a port speed of 1 Gbps. With a difference ofheight clock of 100 m within the network, such a drift can be obtainedwithin two years of uninterrupted service.

In one embodiment, the schedules provided by the configurator device 108are relative to grandmaster time and may ignore time dilation. As aresult, the schedules lose simultaneity. While neglecting time dilationcan be done within an acceptable error margin, the inventive subjectmatter described herein addresses cases where error on the schedulerdevices 102 due to relativity are important. That is, where error causedby clock drift at the nodes 105 can cause time-critical traffic to notbe communicated within the scheduled time window for time-criticaltraffic at one or more of the nodes 105.

Several use cases involving pico-satellites or high-speed networks (forexample, plane-to-ground transmissions, high speed train communications,smart cities interacting with cars in highways, etc.) subject tosignificant gravitational gradient are examples where relativity cancause significant drift in the scheduler device 102.

One or more embodiments of the inventive systems and methods describedherein examine the impact of time synchronization error upontime-sensitive network scheduling by the scheduler device 102 of thecontrol system 107, the impact of time synchronization error on thelocation, placement, or selection of the grandmaster clock device 110 inthe network system 100, and the impact of time synchronization error onbandwidth. The systems and methods define specific local guard bandsthat dynamically change size based on changes in the time dilation. Theguard bands are determined as time periods and/or network bandwidths inwhich non-time-critical Ethernet frame traffic cannot be communicatedthrough the node or nodes that are allocated or assigned the guardbands.

FIG. 2 schematically illustrates a high-level concept behind theanalysis described herein. A network of clock devices 112 represented atthe top of FIG. 2 are assumed to synchronize imperfectly with oneanother due to time dilation. The clock devices 112 provide timing forcorresponding systems of IEEE 802.1Qbv gates 200 represented at thebottom of FIG. 2. These gates 200 can represent the nodes 105 of thenetwork system 100 shown in FIG. 1. Time-sensitive data flows 202 ofdata frames between the gates 200 also are shown in FIG. 2. Clockdevices 112 may never perfectly synchronize and synchronization errorhas an impact on the ability of time sensitive network flows 202 tooperate correctly.

Time-sensitive data flows 202 cross diverse local time references andare subject to time dilation that cannot be measured by the gPTPstandard. For example, FIG. 2 shows clock devices 112 located indifferent altitudes, and subject to different relativities. The clockdevices 112 located in the mountains, for example, are synchronized tothe grand master relative time (e.g., of the grandmaster clock device110 shown in FIG. 1), but time-sensitive network data flows 202 reachingthe clock devices 112 are “accelerating” because of time dilation. Theconfigurator device 108 shown in FIG. 1 can prevent or correct for thisacceleration by applying compensation on the configuration of thescheduler device 102. This compensation can occur by determining a guardband to be applied for communication of data flows at one or more of thenodes 105 or gates 200. This guard band can dynamically change as thecompensation needed to correct for clock drift changes over time.

To compute the impact of time-sensitive network timing error, thescheduler device 102 computes schedules for network bridges (e.g.,switches 104). The scheduler device 102 can use a heuristic approachthat is non-deterministic polynomial-time hardness (NP-hard). Theschedules can be computed by assuming that individual clock error isindependent and normally distributed. The clock devices 112 may driftwith a mean μ and have a variance σ. Each gate system 200 can receive ordetermine time from one of the distributed clocks 112 that issynchronized by the IEEE 802.1AS standard.

Time-sensitive data flow paths are scheduled by the centralizedscheduler device 102 assuming perfect synchronization. If clocksynchronization fails to achieve a sufficient degree of synchronization,this failure could cause multiple Ethernet frames from differenttime-sensitive network flows 202 to be simultaneously transmitted on thesame link. This would cause an alternate scheduling mechanism tomitigate potential collision and frame loss at the expense of anunnecessary and unpredictable delay in transmission. Thus, in thepresence of synchronization error, Ethernet frames in time-sensitivenetwork flows 202 will have a probability of exceeding their maximum,deterministic latency requirement and suffer significant jitter. Undercertain synchronization errors, it may even be possible for Ethernetframes to completely miss scheduled transmission window time and catchanother open window, thus impacting other time-sensitive network flows202 that were initially scheduled on different time windows. A guardband can be dynamically calculated and added to the schedules tomitigate clock error and ensure that time-critical traffic issuccessfully communicated. This provides at least one technical effectof the inventive subject matter described herein. Dynamically alteringthe guard band can ensure that packets (that are needed to be deliveredat certain designated times to ensure the same operation of systemsusing the time-sensitive network) are delivered on time, even with driftof clocks away from the grandmaster clock and/or other differencesbetween the times tracked by the clocks and the master time maintainedby the grandmaster clock.

In one embodiment of the inventive subject matter, the scheduler device102 is provided the details of an Ethernet network system 100 (shown inFIG. 1) and requested time-sensitive network flows 202 and computesschedules for each flow 202. While the scheduler device 102 is designedto operate with real Ethernet networks 100 and manually craftedtime-sensitive network flows 202, one component for this analysis is theability to randomly generate large numbers of time-sensitive networkflows 202 in a large, randomly generated Ethernet network 100. Thus, thescheduler device 102 is able to analyze large, complex time-sensitivenetwork schedules in large, complex networks 100.

Random jitter can be unpredictable and is assumed to be Gaussian (e.g.thermal noise). Deterministic jitter can be predictable and bounded(e.g., duty cycle, distortion, and inter-symbol interference). Clockjitter can have a Gaussian distribution. Jitter and parts-per-million(PPM) are related by

${{df} = {\frac{f}{10^{6}}{PPM}}},$where f is the center frequency of an oscillator and df is the maximumfrequency variation. In one embodiment, the clock devices 112 can beassumed by the scheduler device 102 to have an accuracy of +/−100 PPMwith 5 picoseconds of root mean square (RMS) jitter. The RMS error canbe related to Gaussian variance by σ_(n)/√{square root over (2N)}, whereN is the number of samples (e.g., 10,000) and peak-to-peak period jitterequals +/−3.72 RMS jitter.

One part of the analysis performed by the scheduler device 102 examineshow jitter propagates from one clock device 112 to another clock device112. Random noise can be added by the scheduler device 102, whilecorrelation in noise reduces the purely additive characteristic andcreates additional uncertainty. The scheduler device 102 can propagateclock drift and jitter from the grandmaster clock device 110 through allother (e.g., slave) clock devices 112. For example, the other clockdevices 112 can be repeatedly synchronized with the grandmaster clockdevice 110. The model also considers the fact that path delay reducesthe ability of the gPTP standard to keep slave clock devices 112synchronized with the grandmaster clock device 110. The scheduler device102 implementation enables experimentation with clock accuracy andplacement and determines the impact of clock accuracy experimentation ontime-sensitive network scheduling.

FIG. 3 illustrates a fundamental model showing a master clock device 110and a slave clock device 112 separated by an Ethernet link 103. Theslave clock device 112 is sampling from a Gaussian distribution thatrepresents the dynamics of oscillation in the master clock 110. Theprobability density function will flatten due to jitter (e.g.,variance). Sync messages carrying the latest statistical sample of thetime and frequency of the master clock device 110 can be periodically orotherwise repeatedly sent to the other clock devices 112. The brings thetimes and frequencies of the clock devices 110, 112 back into alignment,subject to drift until the next sync message is sent from the masterclock device 110 to the other clock devices 112. There is a delaybetween corrections limited ultimately by the time to transfer a messageacross the link 103. As a result, the sync messages only correcting thedrift (e.g., the mean), while the Gaussian probability density functionfor the clock devices 112 will continue to flatten further from themaster clock device 110.

In one example, jitter and Allan variance can be disregarded, and onlythe drift for 100 PPM clock devices 110, 112 may be considered. Assuming100 MHz clock devices 110, 112, the clock devices 110, 112 may deviatebetween the limits of −100,000 ns and 100,000 ns every second. If a syncmessage is transmitted from the master clock device 110 to the clockdevices 112 every millisecond (or an even less frequent rate), a slaveclock device 112 can drift from −100 ns to 100 ns, not includingadditional drift due to delay of communication along the link 103.Faster links and a faster sync message transmission rate can enablebetter synchronization between the clock devices 110, 112. Jitter,however, adds to the variance of the clock time distribution andaccumulates along each hop along the links 103 from the master clockdevice 110.

Systemic clock inaccuracy, such as temperature change, also can have animpact. If multiple clock devices 110, 112 experience the sametemperature change and drift at approximately the same rate, the clockdevices 110, 112 can continue to remain correlated with one another andthere is little impact on the timely communication of frames accordingto the schedule dictated by the scheduling device 102. If variance wereimpacted, however, this could have an impact. Since clock drift andvariance can be independently and normally distributed, mean andvariance accumulate via simple summation when experienced throughtime-sensitive paths 103.

Two statistical properties that impact frame scheduling are clockcorrelation and clock variance. One can look at the correlation of clockmeans and sum the clock variances of the clock devices 112 in the nodes105 along a scheduled path 103 for communication of frames between thecomputing devices 106. Thus, for any set of scheduled paths 103, theprobability of Ethernet frame overlap in a schedule can be determined bycomputing the probability of overlap of normal distributions as follows:

$\begin{matrix}{{\frac{\left( {x - \mu_{2}} \right)^{2}}{2\;\sigma_{2}^{2}} - \frac{\left( {x - \mu_{1}} \right)^{2}}{2\;\sigma_{1}^{2}}} = {\log\;\frac{\sigma_{1}}{\sigma_{2}}}} & (2)\end{matrix}$This probability can reflect how likely it is that two or more framescollide on a link 103, which can result in one or all of these framesnot being delivered or otherwise communicated.

In order to eliminate or reduce the likelihood of frame collisions, thescheduler device 102 can schedule the communication of frames to occurthrough or over routes that are along the paths 103 that are most (ormore) immune to clock synchronization inaccuracy, as well as byselecting smaller (e.g., the smallest possible) guard bands that reducethe impact of timing inaccuracies.

FIG. 4 illustrates one example of synchronization error analysis usingmulticast. Vertices are end-systems and switches 104, and are labeledone through eight. Edges are Ethernet links 103 and are also numbered inFIG. 4. Links 18 and 43 experience overlapping paths and thereby areexposed to the possibility of frame transmission overlap.

Path 1 connects vertex 1 to vertices 7, 4, and 6. Path 2 connects fromvertex 5 to vertex 6. Possible contention (e.g., overlap) exists atlinks between vertices 2 and 3, as well as vertices 3 and 6. Eachinterface can be assumed to have a local clock device 112. In theillustrated example, the clock error mean is one microsecond, thevariance is two microseconds, and the required or scheduled end-to-endlatency for communication along each path is 80 ms.

Using the result of the scheduler device 102 for this example and theaccumulated clock error along each path, Path 1 can be computed to havea mean latency of 80 ms and a probability of only 0.5 of meeting thatrequirement given the variance due to clock error along Path 1. Path twohas a mean of 71 ms and a probability of success in meeting that latencyof 0.93.

FIG. 5 illustrates probabilities of frame collision along several paths.FIG. 5 illustrates a matrix of bar plots showing the relationshipbetween every pair of time-sensitive paths 103. The matrix is square,symmetric, and will have all ones along the diagonal, that is, perfectalong the same paths. The probability of overlap is results in theprobability of congestion, increase in latency, and loss of determinismdue to adjacent traffic sharing the same channel.

FIG. 5 also shows the probability of frame buffering along each path 103due to clock synchronization error as computed using (1). The same pathsoverlap perfectly with one another as shown along the diagonal. The moreinteresting plots are in the non-diagonal positions. Since bar graphsform a matrix, the graphs form a symmetric matrix and only examine theupper right diagonal may be examined. In the illustrated example, Pathsone and two will suffer non-deterministic frame delay drops with 0.0027ms (imperceptibly in the bar graph) at the link from vertices two tothree, but there is a 0.42 probability of delay at the link fromvertices three to six in this example.

The notion of time-sensitive network time dilation for guard bands leadsto consideration of the prospects and implications of physicalgravitational time dilation. The uncertainty in time increases with thedistance from the grandmaster clock device 110, and this uncertaintyrequires a proportionally-sized mechanism for compensation, typically aguard band in the network 101. A guard band effectively increases theEthernet frame size by increasing the duration that a gate 200 is open,and thus stretching the effective length of the time-sensitive networkframe. A gate 200 is open during a time period that is scheduled by thescheduler device 102 for communication of data packets through theswitch in that gate 200. The scheduler device 102 can determine a guardband as a time period or bandwidth that a gate 200 remains open forcommunicating data packets. The scheduler device 102 can repeatedlydetermine the clock drift and variance for multiple clock devices 112and, based on the drift and/or variance, determine a probability thatEthernet frames will collide along one or more paths 103 in the network.If the probability is sufficiently large (e.g., greater than a non-zero,previously defined threshold, such as 15%, 20%, or the like), then thescheduler device 102 determines and creates a dynamically adjustableguard band for one or more nodes 105. The guard band defines timeperiods and/or network bandwidth that cannot be used by the node(s) 105for communication of frames along one or more links 103.

The effective change in length of a data frame varies with distance ofthe slave clock device 112 from the grandmaster clock device 110. Forexample, clock devices 112 that are farther from the grandmaster clockdevice 110 (e.g., along links 103 in the Ethernet network) may havelarger guard bands determined by the scheduler device 102. Thiseffective change in length can be referred to as time dilation inanalogy with gravitational time dilation from general relativity. Thescheduler device 102 can use a guard band to guarantee that the switch104 is idle when time-sensitive network frames are transmitted at thecost of dedicating bandwidth for protection. The scheduler device 102can change the size of the guard band for a node 105 at different timesbased on clock drift and/or variance. Thus, the size of the guard bandcan be dynamically changed by the scheduler device 102 to reduce orminimize the time during which a switch 104 is idle, while maintainingdeterminism in the delivery of time-sensitive network frames.

Not all embodiments of the inventive subject matter described herein arelimited to wired networks. One or more embodiments of the inventivesubject matter can be used in connection with entirely or partiallywireless time-sensitive networks. When time-sensitive network devicesare subject to change in motion or altitude, the scheduler device 102 isaffected by time dilation. Guard band sizes can be controlled (e.g., bythe scheduler device 102) as functions not only of distance of a clockdevice 112 from the grandmaster clock device 110, but also of port speedand clock height and speed. For example, the scheduler device 102 cancreate larger guard bands for longer distances along the links 103between a slave clock device 112 and the master clock device 110, andcan create smaller guard bands for shorter distances along the links 103between a slave clock device 112 and the master clock device 110. Thescheduler device 102 can create larger guard bands for switches 104 thatare slower in communicating data frames and can create smaller guardbands for switches 104 that are faster in communicating the data frames.The scheduler device 102 can create larger guard bands for clock devices112 located at higher altitudes and can create smaller guard bands forclock devices 112 located at lower altitudes. The scheduler device 102can create larger guard bands for clock devices 112 that are faster orslower than the master clock device 110 by larger time differences, andcan create smaller guard bands for clock devices 112 that are faster orslower than the master clock device 110 by smaller time differences.

The guard band size can be set by the scheduler device 102 considering aworst-case scenario, for instance, based on the distance of agrandmaster clock device 110 and the height or speed of the clock device112. A control plane can be used to advertise height and speed of thedifferent clocks device 112 to enable switches 104 to continuously orrepeatedly adjust the size of the guard band based on the gPTP errorcorrection and time dilation.

The scheduler device 102 can rely on several metrics and values toallocate a guard band of a variable (e.g., dynamic, or changing withrespect to time) size. The scheduler device 102 can calculate aneigenvalue centrality measure for one or more of the nodes 105, whichcan represent an overall shape of the network 100. Longer, thin networks100 are subject to bigger guard bands than small compact networks 100.For example, networks 100 formed from fewer nodes 105, fewer links 103,and/or having fewer alternate paths of links 103 and nodes 105 betweendevices 106 for data frame communication can be allocated larger guardbands by the scheduler device 102 than networks 100 formed from morenodes 105, more links 103, and/or having more alternate paths of links103 and nodes 105 for communication of data frames between the devices106. Additionally, nodes 105 that are farther from the master clockdevice 110 and/or are farther from a center of the network 100 may beassigned larger guard bands than nodes 105 that are closer to the masterclock device 110 and/or the center of the network 100.

The clock variance at different nodes 105 impacts time-to-time clockmeasurement and is accumulated by all traversed nodes 105. The varianceis an additive parameter in that the total clock variance between theclock devices 112 and the master clock device 110 increases for morenodes 105 along a path for a data frame and/or for larger differencesbetween the clock devices 112 and the master clock device 110 along thepath. The scheduler device 102 can fetch all or many of the variancesfrom the network 100 and compute the total variance of one or more pathsthrough the network 100. The scheduler device 102 can also apply anoverall eigenvalue centrality metric that provides a global variancevalue of the network 100. Each node 105 can add up a local variance ofthat node 105 and the clock reference variance to the global variance ofthe network 100. When the network 100 is made of different time domainswith different reference clock devices 112, the eigenvalue centralitymetrics may differ from one domain to another. The accumulated drift mayalso differ because the clock references do not necessarily sendsynchronization messages at the same rate and the same speed. If atime-sensitive network stream needs to cross multiple time domains, theguard band determined by the scheduler device 102 corresponding to thenode 105 egressing to a new domain is the maximum of this node 105.

By applying an optimal guard band the network resource usage used by theguard band can be decreased, and the heuristic finds more solution toestablish a new time-sensitive network stream (and the number oftime-sensitive network streams on a network is statistically higher withoptimal guard bands). This can lead to a reduced OPEX and a reduced costper bit of data sent over the network 100.

The scheduler device 102 can use eigenvector centrality to estimate theimpact of time-sensitive network time dilation. Eigenvector centralitymeasures or represents the importance of a node 105 in the network 100,such as how far the node 105 is from a location of another node 105, thegrandmaster clock device 110, the center of the network 100, etc. Thisimportance of the node 105 can go beyond simply counting the number ofcomputer devices 106 that interface with the node 105, but also caninclude the degree to which a computer device 106 supports theinterconnection of other highly-connected computer devices 106.

The network edges are weighted by link speed. Let x be the centralitymeasure, a be either zero or one as indicated in the adjacency matrix, λa constant, and f and t indicate the “from” and “to” indices of a vertexin the adjacency matrix respectively as shown in:

$\begin{matrix}{x_{f} = {\frac{1}{\lambda}{\sum\limits_{t}{a_{ft}x_{t}}}}} & (3)\end{matrix}$

This simplifies to (4) below, where λ is the eigenvalue of the adjacencymatrix A. The eigenvector solutions play a wide range of roles innetwork partitioning, dimensionality reduction, and many otherapplications. For the centrality measure, the eigenvectors arenon-negative. This means λ will be the largest of the many possibleeigenvalue solutions, or may be larger than most (but not all) possibleeigenvalue solutions.Ax=λx  (4)

Thus, the eigenvalue centrality of a vertex is simply the eigenvectorelement corresponding to the vertex derived from the adjacency matrixcorresponding the largest eigenvalue. The eigenvector centrality foreach node 105 is viewed as a gravitational gradient through whichtime-sensitive network flows travel. Consider what the eigenvaluecentrality value for a node 105 means if the adjacency matrix isweighted by link speed. The centrality value is a scale factor thatprovides a time dilation correction based upon the topology of thenetwork 100.

A rate of synchronization messages reported to the local clock drift ofthe traversed nodes 104 also can be determined by the scheduler device102. The scheduler device 102 can allocate smaller guard bands forfaster synchronization rates and can allocate larger guard bands forslower synchronization rates. The effect of sync locks, and needs foradjusting flows crossing different time domains, and then subject totime discrepancies also can be determined by the scheduler device 102.

FIG. 6 illustrates a flowchart of one embodiment of a method 700 fordynamically determining guard bands for a time-sensitive network. At702, the clock drifts and the clock variances of nodes 105 can bedetermined. At 704, a maximum or upper accumulated clock offset along atime-sensitive network path of links 103 and nodes 105 is determined.This can be a sum of the clock offsets (e.g., drifts and/or variances)or a sum of the absolute values of the clock offsets) of the clocks 112of the nodes along a path between the devices 106.

At 706, a synchronization rate is communicated to the scheduler devices102. This rate can be adapted to the conditions of the network 100 sothat clock drifts can be diminished. This rate can indicate howfrequently the clock devices 112 of the nodes 105 are synchronized withthe master clock device 110. At 708, one or more guard bands of dynamicsize is determined by and communicated from the scheduler device 102 tothe nodes 105. A guard band can have a size that is based on theschedules of the nodes 105, as well as based on other factors describedherein. If multiple time domains are present in the network 100, thenthe dynamic guard band can be applied on the border schedule.

For a node 105, the guard band can be inserted before and after thescheduled window time of the node 105 for forwarding a time-sensitivenetwork frame. As a result, if the local clock device 112 of the node105 is slightly in advance or late from the universal time of thegrandmaster clock device 110, the queue at the node 105 that forwardsthis frame is maintained open for a duration that is proportional to orotherwise based on the size of the guard band. The size of a guard bandcan be adjusted to the maximum local time error of this node 105 in oneembodiment. A node 105 can measure frequency error of the node 105 on areal-time basis, which also can be used to dynamically adapt the guardband to environmental conditions such as the temperature and the agingof the clock device 112 of that node 105.

Table 1 below shows the delay before the scheduler device 102 iseffected by between two points within a gravitational time dilation atthe point that may make a time-sensitive Ethernet frame of 64 bytes missan associated schedule. Table 1 illustrates the difference in height ofclock devices 112 on the scheduler device 102, for a time-sensitiveEthernet frame of 64 bytes, and as a function of the networktransmission speed. The times expressed in the table show how long aservice must be uninterrupted before seeing such a frame miss ascheduled time window.

TABLE 1 Δ Height 10 Gbps 100 Gbps 1 Tbps  10 m 707 days 70 days 7 days,1 hour, 41 minutes, and 49 seconds  100 m  70 days 7 days, 1 16 hours,hour, 41 58 minutes, minutes, and 10 and 49 seconds seconds 1000 m 7days, 1 16 hours, 1 hour, 41 hour, 41 58 minutes, minutes, minutes, andand 10 and 4 49 seconds seconds seconds

For example, a difference of 100 m from sea level between two clockdevices 112 will result in time dilation of 1.000000000000011 s. Even ifthis change may be too small to be represented by an offset scaled rateratio in gPTP frames, this leads to a cumulated drift of 11 femtosecondper second of usage. Time dilation effects become important after 14days and 3 hours causing a time-sensitive frame of 128 bytes to miss itsschedule at 100 Gbps.

Special relativity applies to devices in motion. In general, this effectcan be neglected. However, when high precision timing is required,correction may need to be applied to the scheduler device 102. Note thatthis time dilation differs from the Doppler-Fizeau effect impacting thefrequency of communication of mobile devices. As the gravitational timedilation, this cannot be measured by gPTP, and a GNSS receiver is notable to apply correction induced by the speed of the device. Table 2shows different effects of speed on the time dilation observed by adevice in motion. Three different speed are shown here and correspondrespectively to a car driving on a highway, a high-speed train, and anairplane in motion. Table 2 shows the difference of speed on thescheduler device 102, for a time-sensitive frame of 64 bytes, and as afunction of the network transmission speed. The times expressed in thetable show how long a service must be uninterrupted before seeing such aframe miss its time window.

TABLE 2 Δ Speed 10 Gbps 100 Gbps 1 Tbps 30 ms⁻¹ 159 days 2 weeks 38hours, 15 minutes, and 5 seconds 90 ms⁻¹  2 weeks 41 hours, 4 hours, 828 minutes, and minutes, 53 seconds and 53 seconds 300 ms⁻¹  37 hours 3hours 22 minutes and 20 and 44 and 24 minutes minutes seconds

Special relativity applies to devices in motion. In general, this effectcan be neglected. However, when high precision timing is required,correction must be applied to the scheduler device 102. Note that thistime dilation differs from the Doppler-Fizeau effect impacting thefrequency of communication of mobile devices. As the gravitational timedilation, this cannot be measured by gPTP, and a GNSS receiver is notable to apply correction induced by the speed of the device. Table 2shows different effects of speed on the time dilation observed by adevice in motion. Three different speed are shown here and correspondrespectively to a car driving on a highway, a high-speed train, and anairplane in motion. Table 2 shows the difference of speed on thescheduler device 102, for a time-sensitive frame of 64 bytes, and as afunction of the network transmission speed. The times expressed in thetable show how long a service must be uninterrupted before seeing such aframe miss its time window.

As a result, the scheduler device 102 optionally can dynamically changethe size of a guard band for a node 105 depending on or based on motionof the node 105. The scheduler device 102 can calculate larger guardbands for nodes 105 that are moving or moving faster than the guardbands for stationary or slower moving nodes 105.

In one embodiment, a method includes determining a clock drift and aclock variance of each node in plural nodes of a time-sensitive Ethernetnetwork, determining an accumulated clock offset along a time-sensitivenetwork path in the time-sensitive network based on the clock drifts andthe clock variances that are determined, determining a guard band havinga dynamic size based on the accumulated clock offset, and restrictingwhen Ethernet frames are communicated through the nodes by communicatingthe guard band with the dynamic size to one or more of the nodes.

Optionally, the method also includes determining an eigenvaluecentrality metric based on a location of one or more of the nodes in thetime-sensitive network, where the dynamic size of the guard band isbased on the eigenvalue centrality metric.

Optionally, the method also includes determining a rate at which clocksynchronization messages are reported to the nodes along thetime-sensitive network path, where the dynamic size of the guard band isbased on the rate at which clock synchronization messages are reportedto the nodes along the time-sensitive network path.

Optionally, the method also includes inserting the guard band before andafter a scheduled window time of forwarding a time-sensitive networkframe at each of the nodes.

Optionally, the clock drift and the clock variance are determined forlocal clock devices of the nodes relative to a master clock device forthe Ethernet network.

Optionally, the guard band is determined as one or more of a time periodor a bandwidth in which non-time-critical Ethernet frame traffic cannotbe communicated through the nodes.

Optionally, the guard band is determined based on distances betweenclock devices of the nodes and a master clock device of the Ethernetnetwork.

Optionally, the guard band is determined based on one or more ofaltitudes or speeds of clock devices of the nodes.

Optionally, the guard band is determined based on motion of one or moreof the nodes.

In one embodiment, a system includes one or more processors configuredto determine a clock drift and a clock variance of each node in pluralnodes of a time-sensitive network. The one or more processors also areconfigured to determine an accumulated clock offset along atime-sensitive network path in the time-sensitive network based on theclock drifts and the clock variances that are determined. The one ormore processors also are configured to determine a guard band having adynamic size based on the accumulated clock offset and to communicatethe guard band with the dynamic size to the nodes. The one or moreprocessors are configured to allocate the guard band to at least one ofthe nodes. The guard band restricts when Ethernet frames arecommunicated through the at least one of the nodes.

Optionally, the one or more processors also are configured to determinean eigenvalue centrality metric based on a location of one or more ofthe nodes in the time-sensitive network. The one or more processors canbe configured to determine the dynamic size of the guard band based onthe eigenvalue centrality metric.

Optionally, the one or more processors are configured to determine arate at which clock synchronization messages are reported to the nodesalong the time-sensitive network path. The one or more processors can beconfigured to determine the dynamic size of the guard band based on therate at which clock synchronization messages are reported to the nodesalong the time-sensitive network path.

Optionally, one or more processors are configured to insert the guardband before and after a scheduled window time of forwarding atime-sensitive network frame at each of the nodes.

Optionally, the one or more processors are configured to determine theclock drift and the clock variance for local clock devices of the nodesrelative to a master clock device for the Ethernet network.

Optionally, the one or more processors are configured to determine theguard band as one or more of a time period or a bandwidth in whichnon-time-critical Ethernet frame traffic cannot be communicated throughthe nodes.

Optionally, the one or more processors are configured to determinedistances between clock devices of the nodes and a master clock deviceof the Ethernet network. The one or more processors also are configuredto determine the guard band based on the distances that are determined.

Optionally, the one or more processors are configured to determine theguard band based on one or more of altitudes or speeds of clock devicesof the nodes.

In one embodiment, a system includes one or more processors configuredto determine clock drifts and clock variances of plural nodes in atime-sensitive Ethernet network. The one or more processors also areconfigured to determine an eigenvalue centrality metric based on alocation of one or more of the nodes in the time-sensitive network. Theone or more processors are configured to dynamically allocate a guardband to one or more of the nodes to prevent communication of one or moreEthernet frames through the one or more nodes during the guard band in atime sensitive network schedule of the Ethernet network. The one or moreprocessors are configured to dynamically allocate the guard band basedon the clock drifts, the clock variances, and the eigenvalue centralitymetric.

Optionally, the one or more processors are configured to dynamicallyallocate the guard band by changing a size of the guard band responsiveto a change in one or more of the clock drifts, the clock variances, orthe eigenvalue centrality metric.

Optionally, the one or more processors are configured to determine anaccumulated clock offset of the nodes along a path between two or morecomputer devices based on the clock drifts and the clock variancesassociated with the nodes along the path. The one or more processor canbe configured to allocate the guard band based on the accumulated clockoffset.

As used herein, an element or step recited in the singular and proceededwith the word “a” or “an” should be understood as not excluding pluralof said elements or steps, unless such exclusion is explicitly stated.Furthermore, references to “one embodiment” of the presently describedsubject matter are not intended to be interpreted as excluding theexistence of additional embodiments that also incorporate the recitedfeatures. Moreover, unless explicitly stated to the contrary,embodiments “comprising” or “having” an element or a plurality ofelements having a particular property may include additional suchelements not having that property.

It is to be understood that the above description is intended to beillustrative, and not restrictive. For example, the above-describedembodiments (and/or aspects thereof) may be used in combination witheach other. In addition, many modifications may be made to adapt aparticular situation or material to the teachings of the subject matterset forth herein without departing from its scope. While the dimensionsand types of materials described herein are intended to define theparameters of the disclosed subject matter, they are by no meanslimiting and are exemplary embodiments. Many other embodiments will beapparent to those of skill in the art upon reviewing the abovedescription. The scope of the subject matter described herein should,therefore, be determined with reference to the appended claims, alongwith the full scope of equivalents to which such claims are entitled. Inthe appended claims, the terms “including” and “in which” are used asthe plain-English equivalents of the respective terms “comprising” and“wherein.” Moreover, in the following claims, the terms “first,”“second,” and “third,” etc. are used merely as labels, and are notintended to impose numerical requirements on their objects. Further, thelimitations of the following claims are not written inmeans-plus-function format and are not intended to be interpreted basedon 35 U.S.C. § 112(f), unless and until such claim limitations expresslyuse the phrase “means for” followed by a statement of function void offurther structure.

This written description uses examples to disclose several embodimentsof the subject matter set forth herein, including the best mode, andalso to enable a person of ordinary skill in the art to practice theembodiments of disclosed subject matter, including making and using thedevices or systems and performing the methods. The patentable scope ofthe subject matter described herein is defined by the claims, and mayinclude other examples that occur to those of ordinary skill in the art.Such other examples are intended to be within the scope of the claims ifthey have structural elements that do not differ from the literallanguage of the claims, or if they include equivalent structuralelements with insubstantial differences from the literal languages ofthe claims.

What is claimed is:
 1. A method comprising: determining a clock driftand a clock variance of each node in plural nodes of a time-sensitiveEthernet network; determining an accumulated clock offset along atime-sensitive network path in the time-sensitive network based on theclock drifts and the clock variances that are determined; determining aneigenvalue centrality metric based on a location of one or more of thenodes in the time-sensitive network, the eigenvalue centrality metricdetermined from a relationship between a first product of an adjacencymatrix of the time-sensitive Ethernet network and the eigenvaluecentrality metric and a second product of a constant value and theeigenvalue centrality metric; determining a guard band having a dynamicsize based on the accumulated clock offset and the eigenvalue centralitymetric; and restricting when Ethernet frames are communicated throughthe nodes by communicating the guard band with the dynamic size to oneor more of the nodes.
 2. The method of claim 1, further comprising:determining a rate at which clock synchronization messages are reportedto the nodes along the time-sensitive network path, wherein the dynamicsize of the guard band is based on the rate at which clocksynchronization messages are reported to the nodes along thetime-sensitive network path.
 3. The method of claim 1, furthercomprising: inserting the guard band before and after a scheduled windowtime of forwarding a time-sensitive network frame at each of the nodes.4. The method of claim 1, wherein the clock drift and the clock varianceare determined for local clock devices of the nodes relative to a masterclock device for the Ethernet network.
 5. The method of claim 1, whereinthe guard band is determined as one or more of a time period or abandwidth in which non-time-critical Ethernet frame traffic cannot becommunicated through the nodes.
 6. The method of claim 1, wherein theguard band is determined based on distances between clock devices of thenodes and a master clock device of the Ethernet network.
 7. The methodof claim 1, wherein the guard band is determined based on one or more ofaltitudes or speeds of clock devices of the nodes.
 8. The method ofclaim 1, wherein the guard band is determined based on motion of one ormore of the nodes.
 9. A system comprising: one or more processorsconfigured to determine a clock drift and a clock variance of each nodein plural nodes of a time-sensitive network, the one or more processorsalso configured to determine an accumulated clock offset along atime-sensitive network path in the time-sensitive network based on theclock drifts and the clock variances that are determined, the one ormore processors configured to determine an eigenvalue centrality metricbased on a location of one or more of the nodes in the time-sensitivenetwork, the eigenvalue centrality metric determined from a relationshipbetween a first product of an adjacency matrix of the time-sensitiveEthernet network and the eigenvalue centrality metric and a secondproduct of a constant value and the eigenvalue centrality metric, theone or more processors also configured to determine a guard band havinga dynamic size based on the accumulated clock offset and the eigenvaluecentrality metric, and to communicate the guard band with the dynamicsize to the nodes, the one or more processors configured to allocate theguard band to at least one of the nodes, the guard band restricting whenEthernet frames are communicated through the at least one of the nodes.10. The system of claim 9, wherein the one or more processors areconfigured to determine a rate at which clock synchronization messagesare reported to the nodes along the time-sensitive network path, whereinthe one or more processors are configured to determine the dynamic sizeof the guard band based on the rate at which clock synchronizationmessages are reported to the nodes along the time-sensitive networkpath.
 11. The system of claim 9, wherein the one or more processors areconfigured to insert the guard band before and after a scheduled windowtime of forwarding a time-sensitive network frame at each of the nodes.12. The system of claim 9, wherein the one or more processors areconfigured to determine the clock drift and the clock variance for localclock devices of the nodes relative to a master clock device for thetime-sensitive network.
 13. The system of claim 9, wherein the one ormore processors are configured to determine the guard band as one ormore of a time period or a bandwidth in which non-time-critical Ethernetframe traffic cannot be communicated through the nodes.
 14. The systemof claim 9, wherein the one or more processors are configured todetermine distances between clock devices of the nodes and a masterclock device of the time-sensitive network, the one or more processorsalso configured to determine the guard band based on the distances thatare determined.
 15. The system of claim 9, wherein the one or moreprocessors are configured to determine the guard band based on one ormore of altitudes or speeds of clock devices of the nodes.
 16. A systemcomprising: one or more processors configured to determine clock driftsand clock variances of plural nodes in a time-sensitive Ethernetnetwork, the one or more processors also configured to determine aneigenvalue centrality metric based on a location of one or more of thenodes in the time-sensitive network, the eigenvalue centrality metricdetermined from a relationship between a first product of an adjacencymatrix of the time-sensitive Ethernet network and the eigenvaluecentrality metric and a second product of a constant value and theeigenvalue centrality metric, wherein the one or more processors areconfigured to dynamically allocate a guard band to one or more of thenodes to prevent communication of one or more Ethernet frames throughthe one or more nodes during the guard band in a time sensitive networkschedule of the Ethernet network, the one or more processors configuredto dynamically allocate the guard band based on the clock drifts, theclock variances, and the eigenvalue centrality metric.
 17. The system ofclaim 16, wherein the one or more processors are configured todynamically allocate the guard band by changing a size of the guard bandresponsive to a change in one or more of the clock drifts, the clockvariances, or the eigenvalue centrality metric.
 18. The system of claim16, wherein the one or more processors are configured to determine anaccumulated clock offset of the nodes along a path between two or morecomputer devices based on the clock drifts and the clock variancesassociated with the nodes along the path, wherein the one or moreprocessors are configured to allocate the guard band based on theaccumulated clock offset.
 19. The system of claim 16, wherein theeigenvalue centrality metric that is determined is a largest value ofseveral values calculated by the one or more processors for theeigenvalue centrality metric of the one or more nodes.
 20. The method ofclaim 1, wherein the eigenvalue centrality metric that is determined isa largest value of several values calculated by the one or moreprocessors for the eigenvalue centrality metric of the one or morenodes.